Practical considerations on Marching Cubes 33 topological correctness
نویسندگان
چکیده
Chernyaev’s Marching Cubes 33 is one of the first algorithms intended to preserve the topology of the trilinear interpolant. In this work, we address three issues with the Marching Cubes 33 algorithm, two of which are related to its original description and one that is related to its variant. In particular, we solve a problem with the core disambiguation procedure of Marching Cubes 33 that prevents the extraction of topologically correct isosurfaces for the ambiguous configuration 13.5. This work closes an existing gap in the topological correctness of Marching Cubes 33. Furthermore, we make our results reproducible, meaning that examples provided in this work can be easily explored and studied. Finally, as part of the philosophy of reproducibility, we provide a corrected version of the Marching Cubes 33 open-source implementation and access to datasets that can be used to verify the correctness of any available topologically correct isosurface extraction implementation that preserves the topology of the trilinear interpolant.
منابع مشابه
Proof of Correctness of a Marching Cubes Algorithm Carried out with Coq
The Marching Cubes algorithm is a well known and widely used approach for extracting a triangulated isosurface from a three-dimensional rectilinear grid of uniformly sampled data values. The algorithm relies on a large manually constructed table which exhaustively enumerates all possible patterns in which the isovalue relates to the values in the nodes of a cubical cell of the grid. For each pa...
متن کاملEdge Flows: Stratified Morse Theory for Simple, Correct Isosurface Extraction
We present a method to characterize the topology of the level sets of trilinearly interpolated scalar fields. Our characterization is based on Morse theory, and in particular a variant called Stratified Morse theory capable of treating the piecewise-smooth aspect of trilinear interpolation. Algorithms such as Marching Cubes generate approximations to these level sets to a varying degree of fide...
متن کامل(No) More Marching Cubes
Isosurfaces, one of the most fundamental volumetric visualization tools, are commonly rendered using the wellknown Marching Cubes cases that approximate contours of trilinearly-interpolated scalar fields. While a complete set of cases has recently been published by Nielson, the formal proof that these cases are the only ones possible and that they are topologically correct is difficult to follo...
متن کاملIsosurface Extraction from Hybrid Unstructured Grids Containing Pentahedral Elements
Grid-based computational simulations often use hybrid unstructured grids consisting of various types of elements. Most commonly used elements are tetrahedral, pentahedral (namely, square pyramids and right triangular prisms) and hexahedral elements. Extracting isosurfaces of scalar fields defined on such hybrid unstructured grids is often done using indirect methods, such as, (a) subdividing al...
متن کاملA Computer-Assisted Proof of Correctness of a Marching Cubes Algorithm
The Marching Cubes algorithm is a well known and widely used approach for extracting a triangulated isosurface from a three-dimensional rectilinear grid of uniformly sampled data values. The algorithm relies on a large manually constructed table which exhaustively enumerates all possible patterns in which the isosurface can intersect a cubical cell of the grid. For each pattern the table contai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Graphics
دوره 37 شماره
صفحات -
تاریخ انتشار 2013